Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs
نویسندگان
چکیده
In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical graphs while preserving the mental map. Both algorithms can be parameterized to trade layout quality for dynamic stability. In particular, we had to develop new metrics which work upon the intermediate results of layout phases. We discuss some properties of the resulting animations by means of examples.
منابع مشابه
Online Hierarchical Graph Drawing
We propose a heuristic for maintaining dynamic hierarchical graph layouts. The heuristic is an on-line interpretation of the static layout algorithm of Sugiyama, Togawa and Toda. It incorporates topological and geometric information with the objective of making layout animations that are both incrementally stable and readable through long editing sequences. We present measurements of an experim...
متن کاملAlgorithms for Area-eecient Orthogonal Drawings
An orthogonal drawing of a graph is a drawing such that nodes are placed on grid points and edges are drawn as sequences of vertical and horizontal segments. In this paper we present linear time algorithms that produce orthogonal drawings of graphs with n nodes. If the maximum degree is four, then the drawing produced by our rst algorithm needs area at most (roughly) 0:76n 2 , and introduces at...
متن کاملAlgorithms for Area-E cient Orthogonal Drawings
An orthogonal drawing of a graph is a drawing such that nodes are placed on grid points and edges are drawn as sequences of vertical and horizontal segments. In this paper we present linear time algorithms that produce orthogonal drawings of graphs with n nodes. If the maximum degree is four, then the drawing produced by our algorithm needs area no greater than 0:76n 2 , and introduces no more ...
متن کاملA Pairing Technique for Area-eecient Orthogonal Drawings ? (extended Abstract)
An orthogonal drawing of a graph is a drawing such that vertices are placed on grid points and edges are drawn as sequences of vertical and horizontal segments. In this paper we present linear time algorithms that produce orthogonal drawings of graphs with n nodes. If the maximum degree is four, then the drawing produced by our rst algorithm needs area no greater than 0:76n 2 , and introduces n...
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کامل